Type-Safe Execution of Mobile Agents in Anonymous Networks
نویسندگان
چکیده
We present a partially-typed semantics for Dπ, a distributed π-calculus. The semantics is designed for open distributed systems in which some sites may harbor malicious agents. Nonetheless, the semantics guarantee traditional type-safety properties at “good” locations by using a mixture of static and dynamic type-checking. The run-time semantics is built on the model of an anonymous network where the source of incoming agents is unknowable. To counteract possible misuse of resources all sites keep a record of local resources against which incoming agents are dynamically typechecked.
منابع مشابه
UNIVERSITY OF SUSSEX COMPUTER SCIENCE Type-Safe Execution of Mobile Agents in Anonymous Networks
We present a partially-typed semantics for Dπ, a distributed π-calculus. The semantics is designed for open distributed systems in which some sites may harbor malicious agents. Nonetheless, the semantics guarantee traditional type-safety properties at " good " locations by using a mixture of static and dynamic type-checking. The run-time semantics is built on the model of an anonymous network w...
متن کاملA Rssi Based Localization Algorithm for WSN Using a Mobile Anchor Node
Wireless sensor networks attracting a great deal of research interest. Accurate localization of sensor nodes is a strong requirement in a wide area of applications. In recent years, several techniques have been proposed for localization in wireless sensor networks. In this paper we present a localization scheme with using only one mobile anchor station and received signal strength indicator tec...
متن کاملA Mobile and Fog-based Computing Method to Execute Smart Device Applications in a Secure Environment
With the rapid growth of smart device and Internet of things applications, the volume of communication and data in networks have increased. Due to the network lag and massive demands, centralized and traditional cloud computing architecture are not accountable to the high users' demands and not proper for execution of delay-sensitive and real time applications. To resolve these challenges, we p...
متن کاملRendezvous of Mobile Agents in Anonymous Networks with Faulty Channels∗
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (asynchronous anonymous multi-agent) rendezvous problem has been studied extensively but only for networks that are safe or fault-free. In this paper, we consider the case when some of the edges in the network are dange...
متن کاملFault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents
The recently established computational equivalence between the traditional message-passing model and the mobile-agents model is based on the existence of a mobile-agents algorithm that simulates the execution of message-passing algorithms. Like most existing protocols for mobile agents, this simulation protocol works correctly only if the agents are fault-free. We consider the problem of perfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998